Secret Sharing over Fast-Fading MIMO Wiretap Channels
نویسندگان
چکیده
Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the source and destination to help sharing secret. This falls under the “channel-type model with wiretapper” considered by Ahlswede and Csiszár. A minor extension of their result (to continuous channel alphabets) is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and wiretapper are then investigated.
منابع مشابه
Almost universal codes for MIMO wiretap channels
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...
متن کاملSecret-Sharing over Correlated Fast-Fading Multiple-Antenna Channels with Public Discussion
We consider secret-key agreement with public discussion over multiple-input multiple-output (MIMO) Rayleigh fast-fading channels under correlated environment. We assume that transmit, legitimate receiver and eavesdropper antennas are correlated. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation ...
متن کاملPractical Secret Sharing in Fast Fading Channels based on Reliability-Based Hybrid ARQ
Consider a wireless communication system in which Alice wishes to transmit a message to Bob in the presence of an eavesdropper, Eve. We consider the design of a communication technique that allows Alice to send a message such that Bob can decode it but Eve can get little information about the message. This scenario is a classic example of the wiretap channel, for which several researchers have ...
متن کاملA coding theorem for secret sharing communication systems with two Gaussian wiretap channels
A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWC’s is described by the capacities and secrecy capacities of two GWC’s.
متن کاملLDPC-BASED SECRET-SHARING SCHEMES FOR WIRETAP CHANNELS By CHAN WONG WONG A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy LDPC-BASED SECRET-SHARING SCHEMES FOR WIRETAP CHANNELS By Chan Wong Wong December 2011 Chair: John M. Shea Cochair: Tan F. Wong Major: Electrical and Computer Engineering This dissertation examines the practical design of secret-sharing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Wireless Comm. and Networking
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009